Equivalence Checking 40 Years After: A Review of Bisimulation Tools
نویسندگان
چکیده
Equivalence checking is a formal verification approach that consists in proving two programs or models are related modulo some equivalence relation, one included the other preorder relation. In case of concurrent systems, which often represented using labelled transition relations used for bisimulations and their simulation preorders. probabilistic stochastic usually Markov chains, lumpability, equivalences, associated The present article provides synthetic overview 40 years research design algorithms software tools checking.
منابع مشابه
Strong Splitting Bisimulation Equivalence
We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...
متن کاملAxiomatising ST-Bisimulation Equivalence
A simple ST operational semantics for a process algebra is provided, by defining a set of operational rules in Plotkin’s style. This algebra comprises TCSP parallel composition, ACP sequential composition and a refinement operator, which is used for replacing an action with an entire process, thus permitting hierarchical specification of systems. We prove that ST-bisimulation equivalence is a c...
متن کاملBisimulation and Language Equivalence
One way to understand an interactive system is firmly rooted in language theory, that a system is its set of runs (or words). Properties of systems are described in a linear time temporal logic. Relationships between automata, language theory and logic are then utilised, such as the theory of ω-regular languages and Büchi automata. An alternative viewpoint is that an interactive system should b...
متن کاملEpistemic Equivalence and Bisimulation
Bisimulation is an equivalence relation over Kripke models. It is often claimed, but little argued for, that bisimulation captures a ‘natural’ notion of similarity in epistemic semantics, in the sense that the differences between bisimilar models are, from an epistemic point of view, irrelevant. In this paper we examine three types of arguments pertaining to the view that bisimilar models are ‘...
متن کاملBisimulation and Model Checking
State space minimization techniques are crucial for combating state explosion. A variety of verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. This paper explores the third use in the context of verifying invariant properties. We consider three bisimulation minimiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-15629-8_13